Measuring Symmetry in Drawings of Graphs

نویسندگان

  • Eric Welch
  • Stephen G. Kobourov
چکیده

Layout symmetry is one of the important and desired features in drawing graphs. While there is a substantial body of work in computer vision around the detection and measurement of symmetry in images, there has been little effort to define and validate meaningful measures of the symmetry of graph drawings. In this paper, we evaluate two algorithms that have been proposed for measuring graph drawing symmetry, comparing their judgments to those of human subjects, and investigating the use of stress as an alternative measure of symmetry. We discuss advantages and disadvantages of these measures, possible ways to improve them, and implications for the design of algorithms that optimize the symmetry in the layout.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toward Measuring Network Aesthetics Based on Symmetry

In this exploratory paper, we discuss quantitative graph-theoretical measures of network aesthetics. Related work in this area has typically focused on geometrical features (e.g., line crossings or edge bendiness) of drawings or visual representations of graphs which purportedly affect an observer’s perception. Here we take a very different approach, abandoning reliance on geometrical propertie...

متن کامل

Symmetric Graph Drawing

This chapter gives an overview of the problem of drawing graphs with as much symmetry as possible. It describes a linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs.

متن کامل

An Algorithm for Drawing a Graph Symmetrically

A technique is described that produces symmetric drawings of a graph G in the plane. The method requries that G have a non-trivial automorphism group Aut(G), and that a non-trivial symmetry g ∈ Aut(G) has been selected in some way. The technique is found to be very effective in practice. It forms a part of the Groups & Graphs** software package. 1. Symmetric Cycles Let G be a connected undirect...

متن کامل

1-Bend Orthogonal Partial Edge Drawing

Recently, a new layout style to avoid edge crossings in straight-line drawings of non-planar graphs received attention. In a Partial Edge Drawing (PED), the middle part of each segment representing an edge is dropped and the two remaining parts, called stubs, are not crossed. To help the user inferring the position of the two end-vertices of each edge, additional properties like symmetry and ho...

متن کامل

On Symmetry of Some Nano Structures

It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2017